Parametrization of approximate algebraic curves by lines
نویسندگان
چکیده
منابع مشابه
Parametrization of approximate algebraic curves by lines
It is well known that irreducible algebraic plane curves having a singularity of maximum multiplicity are rational and can be parametrized by lines. In this paper, given a tolerance ¿ 0 and an -irreducible algebraic plane curve C of degree d having an -singularity of multiplicity d−1, we provide an algorithm that computes a proper parametrization of a rational curve that is exactly parametrizab...
متن کاملParametrization of approximate algebraic surfaces by lines
In this paper we present an algorithm for parametrizing approximate algebraic surfaces by lines. The algorithm is applicable to ε-irreducible algebraic surfaces of degree d having an ε-singularity of multiplicity d − 1, and therefore it generalizes the existing approximate parametrization algorithms. In particular, given a tolerance ε > 0 and an ε-irreducible algebraic surface V of degree d , t...
متن کاملApproximate parametrization of plane algebraic curves by linear systems of curves
It is well known that an irreducible algebraic curve is rational (i.e. parametric) if and only if its genus is zero. In this paper, given a tolerance ǫ > 0 and an ǫ-irreducible algebraic affine plane curve C of proper degree d, we introduce the notion of ǫ-rationality, and we provide an algorithm to parametrize approximately affine ǫ-rational plane curves, without exact singularities at infinit...
متن کاملReal Parametrization of Algebraic Curves
There are various algorithms known for deciding the parametrizability (rationality) of a plane algebraic curve, and if the curve is rational, actually computing a parametrization. Optimality criteria such as low degrees in the parametrization or low degree field extensions are met by some parametrization algorithms. In this paper we investigate real curves. Given a parametrizable plane curve ov...
متن کاملRadical parametrization of algebraic curves and surfaces
Parametrization of algebraic curves and surfaces is a fundamental topic in CAGD (intersections; offsets and conchoids; etc.) There are many results on rational parametrization, in particular in the curve case, but the class of such objects is relatively small. If we allow root extraction, the class of parametrizable objetcs is greatly enlarged (for example, elliptic curves can be parametrized w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.01.010